Voronoi-like partition of lattice in cellular automata

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lattice gases and cellular automata

We review the class of cellular automata known as lattice gases, and their applications to problems in physics and materials science. The presentation is selfcontained, and assumes very little prior knowledge of the subject. Hydrodynamic lattice gases are emphasized, and non-lattice-gas cellular automata – even those with physical applications – are not treated at all. We begin with a review of...

متن کامل

Entropy and Chaos in a Lattice Gas Cellular Automata

We find a simple linear relation between the thermodynamic entropy and the largest Lyapunov exponent (LLE) of an discrete hydrodynamical system, a deterministic, two-dimensional lattice gas automaton (LGCA). This relation can be extended to irreversible processes considering the Boltzmann’s H function and the expansion factor of the LLE. The definition of LLE for cellular automata is based on t...

متن کامل

Partition logics of automata

We introduce a new type of orthomodular poset which is obtained by considering the pasting of partitions of a set. These partition logics appear in the experimental investigation of finite automata and can be related to certain quantum mechanical systems.

متن کامل

Simulation of a Wind Tunnel using Lattice Cellular Automata

In this project fluid flow over various airplane wings was simulated using lattice gas cellular automata (LGCA)[1]. The aim of this simulation was to study how the drag and lift forces on a wing vary for various wing shapes, wing pitches and wind speed. The results of this study are presented, along with key details of the LGCA implementation that was used to construct the wind tunnel and inter...

متن کامل

Cellular Automata: Elementary Cellular Automata

Cellular automata (CA) are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is like computers, data represented by initial configurations which is processed by time evolution to produce output. This paper is an empirical stu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical and Computer Modelling

سال: 1996

ISSN: 0895-7177

DOI: 10.1016/0895-7177(96)00003-9